Inequalities and Identities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identities and Inequalities for Tree Entropy

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede–Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove th...

متن کامل

Anisotropic Picone identities and anisotropic Hardy inequalities

In this paper, we derive an anisotropic Picone identity for the anisotropic Laplacian, which contains some known Picone identities. As applications, a Sturmian comparison principle to the anisotropic elliptic equation and an anisotropic Hardy type inequality are shown.

متن کامل

Pseudo-LYM inequalities and AZ identities

We give pseudo-LYM inequalities in some posets and give a new restriction in this way for their antichains. Typically these posets fail the LYM inequality and some of them are known not to be Sperner.

متن کامل

Inequalities and Identities Involving Sums of Integer Functions

The floor and ceiling functions map a real number to the largest previous or the smallest following integer, respectively. More precisely, the floor function ⌊x⌋ is the largest integer not greater than x and the ceiling function ⌈x⌉ is the smallest integer not less than x. Iverson [7, p. 127] introduced this notation and the terms floor and ceiling in the early 1960’s and now this notation is s...

متن کامل

Identities and Inequalities for Tree Entropy by Russell Lyons

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede-Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2011

ISSN: 1556-5068

DOI: 10.2139/ssrn.1162275